package com.gwcloud.leetcode.tags.dp;

/** 
* @ClassName   : Leetcode1143 
* @author      : ganwei 
* @date        : 2020年5月16日 
* @Description : 1143. 最长公共子序列 
*/
public class Leetcode1143 {
    /**
     * -解题思路，多练练动态规划
     */
	public int longestCommonSubsequence(String text1, String text2) {
    	int m = text1.length(), n = text2.length();
		int[][] dp = new int[m+1][n+1];
		for(int i = 1; i <= m; i++) {
			for(int j = 1; j <= n; j++) {
				if(text1.charAt(i-1) == text2.charAt(j-1)) {
					dp[i][j] = 1 + dp[i-1][j-1];
				}else {
					dp[i][j] = Math.max(dp[i][j-1], dp[i-1][j]);
				}
			}
		}
    	
    	return dp[m][n];
    }
	
	/**
	 * -主函数
	 */
	public static void main(String[] args) {
		String text1 = "abc";
		String text2 = "def";
		Leetcode1143 l1143 = new Leetcode1143();
		System.out.println(l1143.longestCommonSubsequence(text1, text2));
	}
}
